Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS

P2%2DCTM privacy preserving collaborative traffic monitoring.

Discovering private trajectories using background information.

SPRINGL 2009 Workshop Report The 2nd International Workshop on Security and Privacy in GIS and LBS %28Seattle

Suppressing microdata to prevent classification based inference.

ICDM Workshops 2009

Temporal Dynamics of User Interests in Web Search Queries.

Spatio%2Dtemporal access control challenges and applications.

Recent progress in database privacy.

Mining periodic patterns in spatio%2Dtemporal sequences at different time granularities.

Towards Trajectory Anonymization a Generalization%2DBased Approach.
Trajectory datasets are becoming more and more popular due to the massive usage of GPS and other location-based devices and services. In this paper, we address privacy issues regarding the identification of individuals in static trajectory datasets. We provide privacy protection by defining trajectory k-anonymity, meaning every released information refers to at least k users/trajectories. We propose a novel generalization-based approach that applies to trajectories and sequences in general. We also suggest the use of a simple random reconstruction of the original dataset from the anonymization, to overcome possible drawbacks of generalization approaches. We present a utility metric that maximizes the probability of a good representation and propose trajectory anonymization techniques to address time and space sensitive applications. The experimental results over synthetic trajectory datasets show the effectiveness of the proposed approach.
Privacy
Each of two parties PX and P Y holds an n-bit input, x and y, respectively. They wish to privately compute the value of f(x; y). That is, PX should not learn any additional information about y (in the information-theoretic sense) other than what follows from its input x and the function value, f(x; y), and similarly, P Y should not learn any additional information about x.  In this paper we consider two basic questions in the theory of private computations: 1. Which functions can be privately computed ? 2. What is the communication complexity of protocols that privately compute a function  f (in the case that such protocols exist) ? A complete combinatorial characterization of privately computable functions is given. We use this characterization to derive tight bounds on the rounds complexity of any privately computable function, and to design optimal private protocols that compute these functions. We show that for every 1  g(n)  2 \Delta 2  n  there are functions that can be privately...

Privacy in Statistical Databases
We show that the need to maintain privacy in statistical databases  naturally leads to interval computations, and provide feasible algorithms  for the corresponding interval computation problems.

Distributed privacy preserving k%2Dmeans clustering with additive secret sharing.
While the ever increasing computational power together with the huge amount of individual data collected daily by various agencies is of great value for our society, they also pose a significant threat to individual
Towards trajectory anonymization a generalization%2Dbased approach.
Trajectory datasets are becoming more and more popular due to the massive usage of GPS and other location-based devices and services. In this paper, we address privacy issues regarding the identification of individuals in static trajectory datasets. We provide privacy protection by defining trajectory k-anonymity, meaning every released information refers to at least k users/trajectories. We propose a novel generalization-based approach that applies to trajectories and sequences in general. We also suggest the use of a simple random reconstruction of the original dataset from the anonymization, to overcome possible drawbacks of generalization approaches. We present a utility metric that maximizes the probability of a good representation and propose trajectory anonymization techniques to address time and space sensitive applications. The experimental results over synthetic trajectory datasets show the effectiveness of the proposed approach.
Disclosure Risks of Distance Preserving Data Transformations.

Privacy Protection Regulations and Technologies%2C Opportunities and Threats.

Privacy in Spatiotemporal Data Mining.

Efficient Privacy Preserving Distributed Clustering Based on Secret Sharing.

Recent advances in preserving privacy when mining data.

Efficient Privacy Preserving Distributed Clustering Based on Secret Sharing.

A privacy preserving assertion based policy language for federation systems.

Privacy preserving clustering on horizontally partitioned data.
Data mining has been a popular research area for more than a decade due to its vast spectrum of applications.. However, the popularity and wide availability of data mining tools also raised concerns about the privacy of individuals. The aim of privacy preserving data mining researchers is to develop data mining techniques that could be applied on databases without violating the privacy of individuals. Privacy preserving techniques for various data mining models have been proposed, initially for classification on centralized data then for association rules in distributed environments. In this work, we propose methods for constructing the dissimilarity matrix of objects from different sites in a privacy preserving manner which can be used for privacy preserving clustering as well as database joins, record linkage and other operations that require pair-wise comparison of individual private data objects horizontally distributed to multiple sites. We show communication and computation complexity of our protocol by conducting experiments over synthetically generated and real datasets. Each experiment is also performed for a baseline protocol which has no privacy concern to show that the overhead comes with security and privacy by comparing the baseline protocol and our protocol.
PinKDD%2707 privacy%2C security%2C and trust in KDD post%2Dworkshop report.
In this report, we summarize the events of the First International
Computer and Information Sciences %2D ISCIS 2006
Abstract — One problem of classical phase shifting for optical 3D surface reconstruction is the occurrence of ambiguities due to the use of fringe projection. We generally derive a number-theoretical approach to calculate absolute phase measurements which can be used as a base for a reliable surface reconstruction without any ambiguity. The essence of our method is the application of pattern sequences with different periods whereby we homogeneously use all pictures which were taken for the measurement. This leads to a higher average accuracy in the surface reconstruction. Furthermore we propose a technique to avoid typical calculation errors that are produced in classical phase shifting caused by discontinuities, occlusions and reflections on the surface. Index Terms — surface reconstruction, phase shifting, 3D shape measurement, structured light, fringe projection I.
Privacy Preserving Spatio%2DTemporal Clustering on Horizontally Partitioned Data.

Privacy Preserving Clustering on Horizontally Partitioned Data.
Data mining has been a popular research area for more than a decade due to its vast spectrum of applications.. However, the popularity and wide availability of data mining tools also raised concerns about the privacy of individuals. The aim of privacy preserving data mining researchers is to develop data mining techniques that could be applied on databases without violating the privacy of individuals. Privacy preserving techniques for various data mining models have been proposed, initially for classification on centralized data then for association rules in distributed environments. In this work, we propose methods for constructing the dissimilarity matrix of objects from different sites in a privacy preserving manner which can be used for privacy preserving clustering as well as database joins, record linkage and other operations that require pair-wise comparison of individual private data objects horizontally distributed to multiple sites. We show communication and computation complexity of our protocol by conducting experiments over synthetically generated and real datasets. Each experiment is also performed for a baseline protocol which has no privacy concern to show that the overhead comes with security and privacy by comparing the baseline protocol and our protocol.
Modified Association Rule Mining Approach for the MHC%2DPeptide Binding Problem.

Processing count queries over event streams at multiple time granularities.

Suppressing Data Sets to Prevent Discovery of Association Rules.

A Web Service Platform for Web%2DAccessible Archaeological Databases.

Suppressing Microdata to Prevent Probabilistic Classification Based Inference.

Privacy Preserving Data Mining Services on the Web.

Secure Association Rule Sharing.
The sharing of association rules is often beneficial in industry,  but requires privacy safeguards. One may decide to disclose only part  of the knowledge and conceal strategic patterns which we call restrictive  rules. These restrictive rules must be protected before sharing since they  are paramount for strategic decisions and need to remain private. To address  this challenging problem, we propose a unified framework for protecting  sensitive knowledge before sharing. This framework encompasses: (a)  an algorithm that sanitizes restrictive rules, while blocking some inference  channels. We validate our algorithm against real and synthetic datasets;  (b) a set of metrics to evaluate attacks against sensitive knowledge and  the impact of the sanitization. We also introduce a taxonomy of sanitizing  algorithms and a taxonomy of attacks against sensitive knowledge.
Association Rule Hiding.
Large repositories of data contain sensitive information that must be protected against unauthorized access. The protection of the confidentiality of this information has been a long-term goal for the database security research community and for the government statistical agencies. Recent advances in data mining and machine learning algorithms, have increased the disclosure risks that one may encounter when releasing data to outside parties. A key problem, and still not sufficiently investigated, is the need to balance the confidentiality of the disclosed data with the legitimate needs of the data users. Every disclosure limitation method affects, in some way, and modifies true data values and relationships. In this paper, we investigate confidentiality issues of a broad category of rules, the association rules. In particular, we present three strategies and five algorithms for hiding a group of association rules, which is characterized as sensitive. One rule is characterized as sensitive if its disclosure risk is above a certain privacy threshold. Sometimes, sensitive rules should not be disclosed to the public, since among other things, they may be used for inferring sensitive data, or they may provide business competitors with an advantage. We also perform an extensive validation and evaluation study of the hiding algorithms, in order to analyze their time complexity and the impact that they have in the original database. Index Terms- Privacy preserving data mining, association rule mining, sensitive rule hiding. 1
State%2Dof%2Dthe%2Dart in privacy preserving data mining.
We provide here an overview of the new and rapidly emerging research area of privacy preserving data mining. We also propose a classification hierarchy that sets the basis for analyzing the work which has been performed in this context. A detailed review of the work accomplished in this area is also given, along with the coordinates of each work to the classification hierarchy. A brief evaluation is performed, and some initial conclusions are made.

Privacy Preserving Association Rule Mining.
The current trend in the application space towards systems of loosely coupled and dynamically bound components that enables just-in-time integration jeopardizes the security of information that is shared between the broker, the requester, and the provider at runtime. In particular, new advances in data mining and knowledge discovery, that allow for the extraction of hidden knowledge in enormous amount of data, impose new threats on the seamless integration of information. In this paper, we consider the problem of building privacy preserving algorithms for one category of data mining techniques, the association rule mining. We introduce new metrics in order to demonstrate how security issues can be taken into consideration in the general framework of association rule mining, and we show that the complexity of the new heuristics is similar to this of the original algorithms.

Using Unknowns to Prevent Discovery of Association Rules.

Association Rules for Supporting Hoarding in Mobile Computing Environments.

Dealing with Fuzziness in Active Mobile Database Systems.
Current needs of industry required the development of advanced database models like active mobile database systems. An active mobile database system can be designed by incorporation of triggering rules into a mobile computing environment in which the users are able to access a collection of database services using mobile and non-mobile computers at any location. Fuzzy concepts are adapted to the field of databases in order to deal with ambiguous, uncertain data. Fuzziness comes into picture in active mobile databases especially with spatial queries on moving objects. Incorporating fuzziness into rules would also improve the effectiveness of active mobile databases as it provides much flexibility in defining rules for the supported application. In this paper we present some methods to adapt the concepts developed for fuzzy systems to active mobile databases. Key words: Active databases, mobile databases, rule execution, fuzzy databases, fuzzy triggers, fuzzy rule execution. 1 Introducti...
Involving Fuzzy Concepts in Active Mobile Databases.
. Current needs of industry required the development of advanced database models like mobile databases, active databases, and fuzzy databases. Fuzzy concepts are adapted to the field of databases in order to deal with ambiguous, uncertain data. Fuzziness comes into picture in mobile databases especially with moving objects. Incorporating fuzziness into rules would improve the effectiveness of active databases. Rules can be utilized in mobile databases to form a more powerful system, namely an active mobile database. In this paper we investigate the ways in which the concepts developed for fuzzy systems can be integrated to active mobile databases. Key words: Active databases, mobile databases, rule execution, fuzzy databases, fuzzy triggers, fuzzy rule execution. 1 Introduction  Current needs of industry and business necessitated the development of advanced database models which are used to store and retrieve data in complex systems. Three of those advanced databases are of particular ...
Concurrent Rule Execution in Active Databases.

